Verifying authentication protocols: methodology and example

نویسندگان

  • Thomas Y. C. Woo
  • Simon S. Lam
چکیده

We present a new approach to the analysis of authenti-cation protocols. The approach consists of several elements: a speciication language for formally specifying authentication protocols, a semantic model for characterizing protocol executions, an assertion language for stating secrecy and correspondence properties, and procedures for verifying these properties. The main emphasis of this paper is on the assertion language, its semantics, and veriication procedures. In particular , we present a set of proof rules. We also present an example to illustrate our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A METHODOLOGY FOR MECHANICALLY VERIFYING PROTOCOLS USING AN AUTHENTICATION LOGIC Munna

This paper describes a methodology that can be used for rigorously developing authentication protocols for distributed systems. It is based on the logic of authentication proposed by Lampson et al. We implemented the logic of authentication using Higher Order Logic (HOL) as the theorem prover. Based on this implementation, a methodology was developed for analyzing authentication protocols for d...

متن کامل

Fast and Automatic Verification of Authentication and Key Exchange Protocols 1

1 Preliminary versions of this paper appeared in [1, 2]. Summary It is preferable for authentication and key exchange protocols to be verified automatically and rapidly in accordance with security requirements. In order to meet these requirements, we proposed the security verification method (OKT method) for the aforementioned protocols based on Bellare et al.'s model (BPR model) and showed the...

متن کامل

Verifying Security Properties in Unbounded Multiagent Systems

We study the problem of analysing the security for an unbounded number of concurrent sessions of a cryptographic protocol. Our formal model accounts for an arbitrary number of agents involved in a protocol-exchange which is subverted by a Dolev-Yao attacker. We define the parameterised model checking problem with respect to security requirements expressed in temporal-epistemic logics. We formul...

متن کامل

Embedding CSP in PVS. An Application to Authentication Protocols

In [28], Schneider applies CSP to the modelling and analysis of authentication protocols and develops a general proof strategy for verifying authentication properties. This paper shows how the PVS theorem prover can provide e ective mechanical support to the approach.

متن کامل

Process algebraic modeling of authentication protocols for analysis of parallel multi-session executions

Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993